Braids and Signatures

نویسندگان

  • Jean-Marc GAMBAUDO
  • Étienne GHYS
چکیده

In the plane R, we consider the sequence of points xi = (i, 0) (for i = 1, 2, . . .) and we denote by D(r) the disc of radius r, centered at the origin. In the space Xn of n-tuples of distinct points of D(n + 1/2), we consider the equivalence relation that identifies two n-tuples if one is obtained from the other by a permutation of the indices. We denote by X̃n the quotient space and by πn : Xn → X̃n the natural projection. The fundamental group of X̃n, based at πn(x 0 1, x 0 2, . . . , x 0 n), is called the n-th Artin braid group and is denoted by Bn; its elements are called braids. Any braid γ in Bn is represented by a path t ∈ [0, 1] 7→ (x1, x2, . . . , xn) ∈ Xn i.e. by a system of n disjoint arcs t 7→ (t, xi) in the cylinder [0, 1]×D2(n + 1/2), such that πn(x 1 1, x 1 2, . . . , x 1 n) = πn(x 0 1, x 0 2, . . . , x 0 n). The identification (x, 0) ≈ (x, 1) for all x inD(n+1/2) produces a finite collection of simple closed oriented curves in the solid torus R/Z × D(n + 1/2), images of the arcs t 7→ (t, xi). The usual embedding of the solid torus in 3-space R and the compactification of R with a point at infinity, allow us to associate with any braid γ an oriented link i.e. a collection of disjoint embeddings of an oriented circle in the 3-sphere S, called the closed braid associated with γ, and denoted by γ̂ (see Figure 1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Singular Braids

In Vassiliev theory, there is a natural monoid homo-morphism from n-strand singular braids to the group algebra of n-strand braid group. J. Birman conjectured that this monoid homomorphism is injective. We show that the monoid homomor-phism is injective on braids with up to three singularities and that Birman's conjecture is equivalent to that singular braids are dis-tinguishable by Vassiliev b...

متن کامل

Convergence of Handle Reduction of Braids

We give a proof for the convergence of the handle reduction algorithm of braids that is both more simple and more precise than the ones of [2] or [3]. The prerequisites are Garside’s theory of positive braids, and one technical result about Artin’s representation of braids available in chapter V

متن کامل

2 00 4 Virtual Braids

Just as classical knots and links can be represented by the closures of braids, so can virtual knots and links be represented by the closures of virtual braids [17]. Virtual braids have a group structure that can be described by generators and relations, generalizing the generators and relations of the classical braid group. This structure of virtual braids is worth study for its own sake. The ...

متن کامل

Virtual Braids

Just as classical knots and links can be represented by the closures of braids, so can virtual knots and links be represented by the closures of virtual braids [16]. Virtual braids have a group structure that can be described by generators and relations, generalizing the generators and relations of the classical braid group. This structure of virtual braids is worth study for its own sake. The ...

متن کامل

Simple Conjugacy Invariants for Braids

We define simple conjugacy invariants of braids, which we call turning numbers, and investigate their properties. Since our motivation comes from the investigation of periodic orbits of orientation preserving disk homeomorphisms, turning numbers work best for braids with the cyclic permutation, especially for positive permutation cyclic braids.

متن کامل

Composition problems for braids: Membership, Identity and Freeness

In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, B3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for B3, but it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004